On refinement strategies for solving $${\textsc {MINLP}\mathrm{s}}$$ by piecewise linear relaxations: a generalized red refinement
نویسندگان
چکیده
Abstract We investigate the generalized red refinement for n -dimensional simplices that dates back to Freudenthal (Ann Math 43(3):580–582, 1942) in a mixed-integer nonlinear program ( $${\textsc {MINLP}}$$ MINLP ) context. show meets sufficient convergence conditions known solution framework is essentially based on solving piecewise linear relaxations. In addition, we prove applying this procedure results relaxations can be modeled by well-known incremental method established Markowitz and Manne (Econometrica 25(1):84–110, 1957). Finally, numerical from field of alternating current optimal power flow demonstrate applicability such {MIP}}$$ MIP -based frameworks.
منابع مشابه
Mesh Refinement Strategies for Solving Singularly Perturbed Reaction-Diffusion Problems
we consider the numerical approximation of a singularly perturbed reaction-diffusion problem over a square. Two different. approaches are compared namely: adaptive isotropic mesh refinement and anisotropic mesh refinement. Thus, we compare the h-refinement and the Shishkin mesh approaches numerically with PLTMG software [l]. It is shown how isotropic elements lead to over-refinement. and how an...
متن کاملRefinement of Generalized Jacobi (RGJ) Method for Solving System of Linear Equations
In this paper Refinement of Generalized Jacobi (RGJ) method for solving systems of linear algebraic equations is proposed and its convergence is discussed. Few numerical examples are considered to show the efficiency of the Refinement of Generalized Jacobi method over generalized Jacobi method. Mathematics Subject Classification: 65F10, 65F50
متن کاملLU-Decomposition with Iterative Refinement for Solving Sparse Linear Systems
In the solution of a system of linear algebraic equations Ax = b with a large sparse coefficient matrix A, the LU-decomposition with iterative refinement (LUIR) is compared with the LU-decomposition with direct solution (LUDS), which is without iterative refinement. We verify by numerical experiments that the use of sparse matrix techniques with LUIR may result in a reduction of both the comput...
متن کاملAnytime Solving by Solution Refinement By
Date ACKNOWLEDGMENTS Completing a thesis is impossible to achieve without support. I would like to thank Professor Wheeler Ruml, my thesis advisor, for his guidance and support through the process. His influence in instruction, group research, and personal research is invaluable. I would like to give a special thanks to Ethan Burns who provided the thoughtfully crafted search framework that I u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2021
ISSN: ['1862-4480', '1862-4472']
DOI: https://doi.org/10.1007/s11590-021-01740-1